Back to course home
0% completed
Vote For New Content
LinkedIn Hard
Max Points on a Line (hard)
Solution: Max Points on a Line
Closest Binary Search Tree Value II (hard)
Solution: Closest Binary Search Tree Value II
Word Ladder (hard)
Solution: Word Ladder
Median of Two Sorted Arrays (hard)
Solution: Median of Two Sorted Arrays
Largest Rectangle in Histogram (hard)
Solution: Largest Rectangle in Histogram
Serialize and Deserialize Binary Tree (hard)
Solution: Serialize and Deserialize Binary Tree
Remove All Ones With Row and Column Flips II (medium)
Problem Statement
Given a 0-indexed m x n binary matrix, return the minimum number of operations needed to remove all 1's from the matrix.
In one operation, you can choose any i and j such that:
0 <= i < m0 <= j < ngrid[i][j] == 1
and change the values of all cells in row i and column j to zero.
Examples
Example 1:
- Input:
[[1,0,1],
[1,1,1],
[0,1,0]]
- Expected Output:
2 - Justification: First, choose the cell [0,2], and perform operations. The matrix becomes
[[0,0,0],[1,1,0],[0,1,0]]. Then, choose the middle cell [1,1]. The matrix becomes all zeros.
Example 2:
- Input:
[[0,1,0],
[1,1,1],
[0,1,0]]
- Expected Output:
1 - Justification: A single operation on the middle cell (cell [1,1]) flips all the 1s to 0s. Thus, only 1 operation is needed.
Example 3:
- Input:
[[1,1,0,0],
[1,0,1,0],
[0,1,1,0],
[0,0,0,1]]
- Expected Output:
3 - Justification: Choose (0, 1), (1, 2), and (3, 3) cells respectively, and convert all values of respected columns and rows to zero.
Try it yourself
Try solving this question here:
Java
Saved to Cloud
. . . .
Solution: Edit Distance
Solution: Remove All Ones With Row and Column Flips II
Mark as Completed
On this page
Problem Statement
Examples
Try it yourself